Statistical mechanics of broadcast channels using low-density parity-check codes
نویسندگان
چکیده
منابع مشابه
Statistical mechanics of broadcast channels using low-density parity-check codes.
We investigate the use of Gallager's low-density parity-check (LDPC) codes in a degraded broadcast channel, one of the fundamental models in network information theory. Combining linear codes is a standard technique in practical network communication schemes and is known to provide better performance than simple time sharing methods when algebraic codes are used. The statistical physics based a...
متن کاملLow Density Parity Check Codes
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...
متن کاملLow-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...
متن کاملLow-density parity-check codes on Markov channels
Low-density parity-check codes are studied over Markov channels with time-varying gaussian or bit-flipping noise. The belief propagation decoding algorithm is extended to include channel estimation and the gains this extension produce are experimentally determined.
متن کاملStatistical mechanics of low-density parity check error-correcting codes over Galois fields
– A variation of low-density parity check (LDPC) error-correcting codes defined over Galois fields (GF (q)) is investigated using statistical physics. A code of this type is characterised by a sparse random parity check matrix composed of C non-zero elements per column. We examine the dependence of the code performance on the value of q, for finite and infinite C values, both in terms of the th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.67.036703